A Novel Fast Non-negative Matrix Factorization Algorithm and Its Application in Text Clustering
نویسندگان
چکیده
In non-negative matrix factorization, it is difficult to find the optimal non-negative factor matrix in each iterative update. However, with the help of transformation matrix, it is able to derive the optimal non-negative factor matrix for the transformed cost function. Transformation matrix based nonnegative matrix factorization method is proposed and analyzed. It shows that this new method, with comparable complexity as the priori schemes, is efficient in enhancing nonnegative matrix factorization and achieves better performance in NMF based text clustering.
منابع مشابه
Sparse Nonnegative Matrix Factorization for Clustering
Properties of Nonnegative Matrix Factorization (NMF) as a clustering method are studied by relating its formulation to other methods such as K-means clustering. We show how interpreting the objective function of K-means as that of a lower rank approximation with special constraints allows comparisons between the constraints of NMF and K-means and provides the insight that some constraints can b...
متن کاملPart of Speech Induction using Non-negative Matrix Factorization
Unsupervised part-of-speech induction involves the discovery of syntactic categories in a text, given no additional information other than the text itself. One requirement of an induction system is the ability to handle multiple categories for each word, in order to deal with word sense ambiguity. We construct an algorithm for unsupervised part-of-speech induction, treating the problem as one o...
متن کاملONP-MF: An Orthogonal Nonnegative Matrix Factorization Algorithm with Application to Clustering
Given a nonnegative matrix M , the orthogonal nonnegative matrix factorization (ONMF) problem consists in finding a nonnegative matrix U and an orthogonal nonnegative matrix V such that the product UV is as close as possible to M . The importance of ONMF comes from its tight connection with data clustering. In this paper, we propose a new ONMF method, called ONP-MF, and we show that it performs...
متن کاملVoice-based Age and Gender Recognition using Training Generative Sparse Model
Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...
متن کاملDC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling
The importance of unsupervised clustering and topic modeling is well recognized with ever-increasing volumes of text data available from numerous sources. Nonnegative matrix factorization (NMF) has proven to be a successful method for cluster and topic discovery in unlabeled data sets. In this paper, we propose a fast algorithm for computing NMF using a divide-and-conquer strategy, called DC-NM...
متن کامل